An Attack on Two Hash Functions by Zheng-Matsumoto-Imai
نویسندگان
چکیده
In [ZMI89,ZMI90] two constructions for a collision resistant hash function were proposed. The first scheme is based on a block cipher, and the second scheme uses modular arithmetic. It is shown in this paper that both proposals have serious weaknesses.
منابع مشابه
Duality between Two Cryptographic Primitives
This paper reveals a duality between constructions of two basic cryptographic primitives pseudo random string generators and one way hash functions Applying the duality we present a construction for universal one way hash functions assuming the existence of one way permutations Under a stronger assumption the existence of distinction intractable permutations we prove that the construction const...
متن کاملProvably Secure One-Way Hash Functions
This paper surveys recent progress on the construction of provably secure one-way hash functions, under gradually weakened assumptions. One-way hash functions have many cryptographic applications. In digital signatures, they are used to compress long input strings prior to actual signing procedures. This usually greatly improves the overall efficiency of a signature scheme. They are also used t...
متن کاملStructural Properties of One-way Hash Functions
We study the following two kinds of one-way hash functions: universal oneway hash functions (UOHs) and collision intractable hash functions (CIHs). The main property of the former is that given an initial-string x, it is computationally difficult to find a different string y that collides with x. And the main property of the latter is that it is computationally difficult to find a pair x 6= y o...
متن کاملConnections among Several Versions of One-way Hash Functions 1
We study the following two kinds of one-way hash functions: universal one-way hash functions (UOHs) and collision intractable hash functions (CIHs). The main property of the former is that given an initial-string x, it is computationally diicult to nd a diierent string y that collides with x. And the main property of the latter is that it is computationally diicult to nd a pair x 6 = y of strin...
متن کاملOn the Design of Secure and Fast Double Block Length Hash Functions
In this work the security of the rate-1 double block length hash functions, which based on a block cipher with a block length of n-bit and a key length of 2n-bit, is reconsidered. Counter-examples and new attacks are presented on this general class of double block length hash functions with rate 1, which disclose uncovered flaws in the necessary conditions given by Satoh et al. and Hirose. Prei...
متن کامل